List Decoding Group Homomorphisms Between Supersolvable Groups
نویسندگان
چکیده
We show that the set of homomorphisms between two supersolvable groups can be locally list decoded up to the minimum distance of the code, extending the results of Dinur et al who studied the case where the groups are abelian. Moreover, when specialized to the abelian case, our proof is more streamlined and gives a better constant in the exponent of the list size. The constant is improved from about 3.5 million to 105. 1998 ACM Subject Classification F.2.2 Computation on Discrete Structures
منابع مشابه
Local Decoding and Testing for Homomorphisms
Locally decodable codes (LDCs) have played a central role in many recent results in theoretical computer science. The role of finite fields, and in particular, low-degree polynomials over finite fields, in the construction of these objects is well studied. However the role of group homomorphisms in the construction of such codes is not as widely studied. Here we initiate a systematic study of l...
متن کاملNearly Supersolvable Groups and Applications to Artin L-functions
In this note, we apply the group-theoretic method to study Artin’s conjecture, and introduce the notations of nearly nilpotent groups and nearly supersolvable groups to answer of a question of Arthur and Clozel. As an application, we show that Artin’s conjecture is valid for all nearly supersolvable Galois extensions of number fields as well as all solvable Frobenius extensions.
متن کاملGenerating fast Fourier transforms of solvable groups
This paper presents a new algorithm for constructing a complete list of pairwise inequivalent ordinary irreducible representations of a finite solvable group G. The input of the algorithm is a pc-presentation corresponding to a composition series refining a chief series of G. Modifying the Baum-Clausen-Algorithm for supersolvable groups and combining this with an idea of Plesken for constructin...
متن کاملA broad class of shellable lattices
We introduce a new class of lattices, the modernistic lattices, and their duals, the comodernistic lattices. We show that every modernistic or comodernistic lattice has shellable order complex. We go on to exhibit a large number of examples of (co)modernistic lattices. We show comodernism for two main families of lattices that were not previously known to be shellable: the order congruence latt...
متن کاملComputing Irreducible Representations of Supersolvable Groups
Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time 0(n2 log«). We present an improved algorithm with running time 0(n log/?).
متن کامل